Review on unrelated parallel machine scheduling problem with additional resources
نویسندگان
چکیده
This study deals with an unrelated parallel machine scheduling problem additional resources (UPMR). That is one of the important sub-problems in scheduling. UPMR consists a set jobs on machines. In addition to that, number or more are needed. very and its importance comes from wealth applications; they applicable engineering scientific situations manufacturing systems such as industrial robots, nurses, operators, bus drivers, tools, assembly plant machines, fixtures, pallets, electricity, mechanics, dies, automated guided vehicles, fuel, more. The also concern about limitation that dedicated for production process. Therefore, researchers decision makers still working get optimum schedule all instances which have not been obtained this day. able increase profits decrease costs whilst satisfying customers’ needs. research aims review discuss studies related machines resources. Overall, demonstrates criticality resolving problem. Metaheuristic techniques exhibit significant effectiveness generating results surpassing other algorithms. Nevertheless, continued improvement essential satisfy evolving requirements UPMR, subject operational changes based customer demand.
منابع مشابه
Approximation of the parallel machine scheduling problem with additional unit resources
We consider the problem of minimizing the makespan of a schedule on m parallel machines of n jobs, where each job requires exactly one of s additional unit resources. This problem collapses to P ||Cmax if every job requires a different resource. It is therefore NP-hard even if we fix the number of machines to 2 and strongly NP-hard in general. Although very basic, its approximability is not kno...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملFlexible flowshop scheduling with equal number of unrelated parallel machines
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Iraqi journal for computer science and mathematics
سال: 2023
ISSN: ['2788-7421']
DOI: https://doi.org/10.52866/ijcsm.2023.02.02.020